Using El Gamal Cryptosystem in Message Feedback Mode for Computing Cost Reduction
نویسندگان
چکیده
This paper discuses comparatively more efficient and cost effective scheme of El Gamal Cryptosystem by introducing the concept of using the established cryptosystems into message feedback mode. The idea behind this is, “an established cryptographic scheme can be used to initiate any communication, and further users may switch to some lightweight process so that the degree of secrecy is maintained by means of the public key cryptosystem and the performance is achieved by using some other lightweight process. Approach discussed in this paper is of using message itself as One Time Pad (OTP), because any automation can‟t produce any random pad than a human being, and their messages posses same property. The length of Key used in El Gamal encryption and size of OTP determines the level of secrecy offered by the proposed system. Further a discussion is made upon the other dimensions of degree of security provided in such implementation. So as a result an applied approach is presented to design a data security mechanism for which users will use message itself as a One Time Pad and El Gamal Cryptosystem to initiate the operations and subsequent steps will involve simple XOR operations for cryptographic purpose. General Terms Cryptography, Network Security, Public Key Cryptosystem, El-Gamal Algorithm
منابع مشابه
A simple generalization of El-Gamal cryptosystem to non-abelian groups
In this paper we study the MOR cryptosystem. We use the group of unitriangular matrices over a finite field as the non-abelian group in the MOR cryptosystem. We show that a cryptosystem similar to the El-Gamal cryptosystem over finite fields can be built using the proposed groups and a set of automorphisms of these groups. We also show that the security of this proposed MOR cryptosystem is equi...
متن کاملA note on using finite non-abelian p-groups in the MOR cryptosystem
The MOR cryptosystem [9] is a natural generalization of the El-Gamal cryptosystem to non-abelian groups. Using a p-group, a cryptosystem was built in [4]. It seems resoanable to assume the cryptosystem is as secure as the El-Gamal cryptosystem over finite fields. A natural question arises can one make a better cryptosystem using p-groups? In this paper we show that the answer is no.
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملA Public-Key Cryptosystem Based on Lucas Sequences
Based on Lucas functions, an improved version of Diffie-hellman key distribution, El Gamal public key crypto-system scheme and El Gamal signature scheme are proposed, together with an implementation and computational cost. The security relies on the difficulty of factoring an RSA integer and on the difficulty of computing the discrete logarithm. Introduction In [1], Diffie and Hellman introduce...
متن کاملExtensions to the Paillier Cryptosystem with Applications to Cryptological Protocols
The main contribution of this thesis is a simplification, a generalization and some modifications of the homomorphic cryptosystem proposed by Paillier in 1999, and several cryptological protocols that follow from these changes. The Paillier cryptosystem is an additive homomorphic cryptosystem, meaning that one can combine ciphertexts into a new ciphertext that is the encryption of the sum of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013